Evolving Shelah‐Spencer graphs
نویسندگان
چکیده
منابع مشابه
Mining Temporally Evolving Graphs
Web mining has been explored to a vast degree and different techniques have been proposed for a variety of applications that include Web Search, Web Classification, Web Personalization etc. Most research on Web mining has been from a ‘data-centric’ point of view. The focus has been primarily on developing measures and applications based on data collected from content, structure and usage of Web...
متن کاملCommunity Detection on Evolving Graphs
Clustering is a fundamental step in many information-retrieval and data-mining applications. Detecting clusters in graphs is also a key tool for finding the community structure in social and behavioral networks. In many of these applications, the input graph evolves over time in a continual and decentralized manner, and, to maintain a good clustering, the clustering algorithm needs to repeatedl...
متن کاملQuerying Evolving Graphs with Portal
Graphs are used to represent a plethora of phenomena, from the Web and social networks, to biological pathways, to semantic knowledge bases. Arguably the most interesting and important questions one can ask about graphs have to do with their evolution. Which Web pages are showing an increasing popularity trend? How does influence propagate in social networks? How does knowledge evolve? Much res...
متن کاملJavaGenes: Evolving Graphs with Crossover
Many genetic algorithms use binary string or tree representations. We have developed a novel crossover operator for a directed and undirected graph representation, and used this operator to evolve molecules and circuits. Unlike strings or trees, a single point in the representation cannot divide every possible graph into two parts, because graphs may contain cycles. Thus, the crossover operator...
متن کاملHow to Cluster Evolving Graphs
Clustering is a frequently used tool in the analysis and evaluation of large and complex networks. Most such networks result from or model dynamic processes, thus clustering techniques need to be adapted. We provide a model for clustering graphs that are subject to changes. More precisely, we address the update problem, i. e., maintaining the clustering while nodes and edges can be inserted and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Logic Quarterly
سال: 2021
ISSN: 0942-5616,1521-3870
DOI: 10.1002/malq.201900053